IP Address Lookup Algorithm Using a Vectored Bloom Filter
نویسندگان
چکیده
منابع مشابه
IP-address lookup using LC-tries
There has recently been a notable interest in the organization of routing information to enable fast lookup of IP addresses. The interest is primarily motivated by the goal of building multi-Gb/s routers for the Internet, without having to rely on multi-layer switching techniques. We address this problem by using an LC-trie, a trie structure with combined path and level compression. This data s...
متن کاملIP-Address Lookup Using Hardware Pipelining
Fast IP address lookup mechanism is a major design issue for the next generation routers. The existing scheme performs the IP address lookup by hardware in which the forwarding table can be compressed to fit into reasonable-size SRAM, and a lookup can be accomplished in three memory accesses. In this article, we claim that with a little extra memory, it is able to further reduce the lookup time...
متن کاملAn efficient IP address lookup algorithm based on a small balanced tree using entry reduction
Due to a tremendous increase in internet traffic, backbone routers must have the capability to forward massive incoming packets at several gigabits per second. IP address lookup is one of the most challenging tasks for high-speed packet forwarding. Some high-end routers have been implemented with hardware parallelism using ternary content addressable memory (TCAM). However, TCAM is much more ex...
متن کاملHigh-speed IP address lookup using balanced multi-way trees
Rapid growth of the Internet traffic requires more bandwidth and high-speed packet processing in the Internet routers. As one of the major packet processing performed in routers, address lookup determines an output port using the destination IP address of incoming packets. Since routers should perform address lookups in real-time for hundred millions of incoming packets per second referring a h...
متن کاملUniversit a Di Pisa Ip Address Lookup Made Fast and Simple Ip Address Lookup Made Fast and Simple
The IP address lookup problem is one of the major bottlenecks in high performance routers. Previous solutions to this problem rst describe it in the general terms of longest preex matching and, then, are experimented on real routing tables T. In this paper, we follow the opposite direction. We start out from the experimental analysis of real data and, based upon our ndings, we provide a new and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Transactions of The Korean Institute of Electrical Engineers
سال: 2016
ISSN: 1975-8359
DOI: 10.5370/kiee.2016.65.12.2061